n) approximation and integrality gap for EDP and UFP in undirected graphs and DAGs
نویسندگان
چکیده
We consider the maximization version of the edge disjoint path problem (EDP). In undirected graphs and directed acyclic graphs, we obtain anO( √ n) upper bound on the approximation ratio where n is the number of nodes in the graph. We show this by establishing the upper bound on the integrality gap of the natural multicommodity flow based relaxation. Our upper bound matches to within a constant factor a lower bound of Ω( √ n) that is known for both undirected and directed acyclic graphs. The best previous upper bounds on the integrality gaps were O(min{n, √ m}) for undirected graphs and O(min{ √ n log n, √ m}) for directed acyclic graphs; here m is the number of edges in the graph. These bounds are also the best known approximation ratios for these problems. Our bound also extends to the unsplittable flow problem (UFP) when the maximum demand is at most the minimum capacity.
منابع مشابه
An O(n) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow in Undirected Graphs and DAGs
We consider the maximization version of the edge-disjoint path problem (EDP). In undirected graphs and directed acyclic graphs, we obtain an O( √ n) upper bound on the approximation ratio where n is the number of nodes in the graph. We show this by establishing the upper bound on the integrality gap of the natural relaxation based on multicommodity flows. Our upper bound matches within a consta...
متن کاملAn O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow
We consider the maximization version of the edge-disjoint path problem (EDP). In undirected graphs and directed acyclic graphs, we obtain an O( √ n) upper bound on the approximation ratio where n is the number of nodes in the graph. We show this by establishing the upper bound on the integrality gap of the natural relaxation based on multicommodity flows. Our upper bound matches within a consta...
متن کاملNew Hardness Results for Undirected Edge Disjoint Paths
In the edge-disjoint paths (EDP) problem, we are given a graph G and a set of source-sink pairs in G. The goal is connect as many pairs as possible in an edge-disjoint manner. This problem is NP-hard and the best known approximation algorithm gives an Õ(min{n2/3,√m})-approximation for both directed and undirected graphs; here n and m denote the number of vertices and edges in G respectively. Fo...
متن کاملUnsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
We consider the unsplittable flow problem (UFP) and the closely related column-restricted packing integer programs (CPIPs). In UFP we are given an edge-capacitated graph G = (V,E) and k request pairs R1, . . . , Rk where each Ri consists of a source-destination pair (si, ti), a demand di and a weight wi. The goal is to find a maximum weight subset of requests that can be routed unsplittably in ...
متن کاملConstant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation
We consider subset feedback edge and vertex set problems in undirected graphs. The input to these problems is an undirected graph G = (V,E) and a set S = {s1, s2, . . . , sk} ⊂ V of k terminals. A cycle in G is interesting if it contains a terminal. In the Subset Feedback Edge Set problem (SubsetFES) the input graph is edge-weighted and the goal is to remove a minimum weight set of edges such t...
متن کامل